Mapping Simple Polygons
نویسندگان
چکیده
منابع مشابه
Mapping Polygons
This thesis is concerned with simple agents that move from vertex to vertex along straight lines inside a simple polygon with the goal of reconstructing the visibility graph. The visibility graph has a node for each vertex of the polygon with an edge between two nodes if the corresponding vertices see each other, i.e., if they can be connected by a straight line inside the polygon. While at a v...
متن کاملRouting in Simple Polygons
A routing scheme R in a network G = (V,E) is an algorithm that allows to send messages from one node to another in the network. We are first allowed a preprocessing phase in which we assign a unique label to each node p ∈ V and a routing table with additional information. After this preprocessing, the routing algorithm itself must be local (i.e., we can only use the information from the label o...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملDetecting Weakly Simple Polygons
5 A closed curve in the plane is weakly simple if it is the limit (in the Fréchet metric) 6 of a sequence of simple closed curves. We describe an algorithm to determine whether 7 a closed walk of length n in a simple plane graph is weakly simple in O(n log n) time, 8 improving an earlier O(n3)-time algorithm of Cortese et al. [Discrete Math. 2009]. As 9 an immediate corollary, we obtain the fir...
متن کاملExploring Simple Grid Polygons
We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it can determine only which of the four cells adjacent to its current position are free and which are blocked, i. e., unaccessible for the robot. Therefore, the robot must enter a cell in order to explore it. The robot has to vis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2015
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2700223